Generic determinacy of Nash equilibrium in network-formation games
نویسنده
چکیده
This paper shows that the set of probability distributions over networks induced by Nash equilibria of the network formation game proposed by Myerson (1991) is finite for a generic assignment of payoffs to networks. The same result can be extended to several variations of the game found in the literature.
منابع مشابه
Costly network formation and regular equilibria
We prove that for generic network-formation games where players incur a strictly positive cost to propose links the number of Nash equilibria is finite. Furthermore all Nash equilibria are regular and, therefore, stable sets.
متن کاملFrom winning strategy to Nash equilibrium
Game theory is usually considered applied mathematics, but a few game-theoretic results, such as Borel determinacy, were developed by mathematicians for mathematics in a broad sense. These results usually state determinacy, i.e. the existence of a winning strategy in games that involve two players and two outcomes saying who wins. In a multi-outcome setting, the notion of winning strategy is ir...
متن کاملUsing and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators
With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...
متن کاملExtending Finite Memory Determinacy to Multiplayer Games
We provide several techniques to extend finite memory determinacy from some restricted class of games played on a finite graph to a larger class. As a particular example, we study energy parity games. First we show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built fro...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Games and Economic Behavior
دوره 66 شماره
صفحات -
تاریخ انتشار 2009